Pii: S0925-7721(01)00068-2
نویسندگان
چکیده
Reconstruction of polygons from visibility information is known to be a difficult problem in general. In this paper, we consider a special case: reconstruction of orthogonal polygons from horizontal and vertical visibility information and show that this reconstruction can be performed in O(n logn) time. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0925-7721(01)00015-3
In this paper we present a heuristic to reconstruct nonsmooth curves with multiple components. Experiments with several input data reveals the effectiveness of the algorithm in contrast with the other competing algorithms. 2001 Elsevier Science B.V. All rights reserved.
متن کاملTriangulations in CGAL
This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library Cgal.
متن کاملOn the number of disjoint convex quadrilaterals for a planar point set
For a given planar point set P , consider a partition of P into disjoint convex polygons. In this paper, we estimate the maximum number of convex quadrilaterals in all partitions. 2001 Elsevier Science B.V. All rights reserved.
متن کامل